Explaining Subsumption by Optimal Interpolation
نویسنده
چکیده
We describe ongoing research to support the construction of terminologies with Description Logics. For the explanation of subsumption we search for particular concepts because of their syntactic and semantic properties. More precisely, the set of explanations for a subsumption P N is the set of optimal interpolants for P and N . We provide definitions for optimal interpolation and an algorithm based on Boolean minimisation of concept-names in a tableau proof for ALC-satisfiability. Finally, we describe our implementation and some experiments to assess the computational scalability of our proposal.
منابع مشابه
Computing ALCH-Subsumption Modules Using Uniform Interpolation
We investigate how minimal subsumption modules can be extracted using methods for uniform interpolation and forgetting. Given an ontology and a signature of concept and role names, a subsumption module is a subset of the ontology that preserves all logical entailments that can be expressed in the description logic of the ontology using only terms in the specified signature. As such, they are us...
متن کاملComputing ALCH
We investigate how minimal subsumption modules can be extracted using methods for uniform interpolation and forgetting. Given an ontology and a signature of concept and role names, a subsumption module is a subset of the ontology that preserves all logical entailments that can be expressed in the description logic of the ontology using only terms in the specified signature. As such, they are us...
متن کاملExplaining Subsumption and Patching Non-Subsumption with Tableaux Methods
Explaining Subsumption and Unsatisfiability Our approach follows the idea of adapting a tableaux algorithm for explaining subsumption and unsatisfiability as suggested in [1, 4]. The explanation follows the proof and uses the structure of a tableaux tree for the production of natural-language explanations. Our method covers the DL SHIN including GCIs. We rely on a data structure for annotated t...
متن کاملAn Optimal G^2-Hermite Interpolation by Rational Cubic Bézier Curves
In this paper, we study a geometric G^2 Hermite interpolation by planar rational cubic Bézier curves. Two data points, two tangent vectors and two signed curvatures interpolated per each rational segment. We give the necessary and the sufficient intrinsic geometric conditions for two C^2 parametric curves to be connected with G2 continuity. Locally, the free parameters w...
متن کاملLocality and applications to subsumption testing and interpolation in $\mathcal{EL}$ and some of its extensions
In this paper we show that subsumption problems in lightweight description logics (such as E L and E L ) can be expressed as uniform word problems in classes of semilattices with monotone operators. We use possibilities of efficient local reasoning in such classes of algebras, to obtain uniform PTIME decision procedures for CBox subsumption in E L , E L + and extensions thereof. These locality ...
متن کامل